The multichromatic numbers of some Kneser graphs
نویسنده
چکیده
The Kneser graph K(m, n) has the n-subsets of {1, 2 . . . . . m} as its vertices, two such vertices being adjacent whenever they are disjoint. The kth multichromatic number of the graph G is the least integer t such that the vertices of G can be assigned k-subsets of {1, 2,... ,t}, so that adjacent vertices of G receive disjoint sets. The values of xk(K(m, n)) are computed for n = 2, 3 and bounded for n/> 4. © 1998 Elsevier Science B.V. All rights reserved
منابع مشابه
On the topological lower bound for the multichromatic number
In 1976 Stahl [13] de ned the m-tuple coloring of a graph G and formulated a conjecture on the multichromatic number of Kneser graphs. For m = 1 this conjecture is Kneser's conjecture which was solved by Lovász [10]. Here we show that Lovász's topological lower bound in this way cannot prove Stahl's conjecture. We obtain that the strongest index bound only gives the trivial m · ω(G) lower bound...
متن کاملA short proof for Chen's Alternative Kneser Coloring Lemma
We give a short proof for Chen’s Alternative Kneser Coloring Lemma. This leads to a short proof for the Johnson-Holroyd-Stahl conjecture that Kneser graphs have their circular chromatic numbers equal to their chromatic numbers.
متن کاملCircular chromatic numbers of some reduced Kneser graphs
The vertex set of the reduced Kneser graph KG2(m, 2) consists of all pairs {a, b} such that a, b ∈ {1, 2, . . . ,m} and 2 ≤ |a−b| ≤ m−2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if m ≥ 4 and m 6= 5, then the circular chromatic number of KG2(m, 2) is equal to m − 2, its ordinary chromatic number.
متن کاملOn Fall Colorings of Kneser Graphs
A fall k-coloring of a graph G is a proper k-coloring of G such that each vertex of G sees all k colors on its closed neighborhood. In this note, we characterize all fall colorings of Kneser graphs of type KG(n, 2) for n ≥ 2 and study some fall colorings of KG(n,m) in some special cases and introduce some bounds for fall colorings of Kneser graphs.
متن کاملShifts of the stable Kneser graphs and hom-idempotence
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n, k) are not weakly hom-idempotent for n ≥ 2k + 1, k ≥ 2. For s ≥ 2, we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 185 شماره
صفحات -
تاریخ انتشار 1998